An iterative inversion approach to blind source separation

نویسندگان

  • Sergio Cruces
  • Andrzej Cichocki
  • Luis Castedo
چکیده

In this paper we present an iterative inversion (II) approach to blind source separation (BSS). It consists of a quasi-Newton method for the resolution of an estimating equation obtained from the implicit inversion of a robust estimate of the mixing system. The resulting learning rule includes several existing algorithms for BSS as particular cases giving them a novel and unified interpretation.It also provides a justification of the Cardoso and Laheld step size normalization. The II method is first presented for instantaneous mixtures and then extended to the problem of blind separation of convolutive mixtures. Finally, we derive the necessary and sufficient asymptotic stability conditions for both the instantaneous and convolutive methods to converge.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Iterative Eigendecomposition Approach to Blind Source Separation

In this work we address the generalized eigendecomposition approach (GED) to the blind source separation problem. We present an alternative formulation for GED based on the definition of congruent pencils. Making use of this definition, and matrix block operations, the eigendecompostion approach to blind source separation is completely characterized. We also present an iterative method to compu...

متن کامل

An Uniied Perspective of Blind Source Separation Adaptive Algorithms

Blind Source Separation (BSS) is an important topic in signal processing and neural networks where a lot of adaptive algorithms have been recently proposed. These algorithms, however, have been developed from many diierent points of view. This paper shows that most algorithms can be derived from a single guiding principle: the inversion of a nonlinear correlation matrix. The inversion is carrie...

متن کامل

A Time Domain Algorithm for Blind Separation of Convolutive Sound Mixtures and L1 Constrained Minimization of Cross Correlations

Abstract. A time domain blind source separation algorithm of convolutive sound mixtures is studied based on a compact partial inversion formula in closed form. An l1-constrained minimization problem is formulated to find demixing filter coefficients for source separation while capturing scaling invariance and sparseness of solutions. The minimization aims to reduce (lagged) cross correlations o...

متن کامل

An Iterative Blind Source Separation Method for Convolutive Mixtures of Images

The paper deals with blind source separation of images. The model which is adopted here is a convolutive multi-dimensional one. Recent results about polynomial matrices in several indeterminates are used to prove the invertibility of the mixing process. We then extend an iterative blind source separation method to the multi-dimensional case and show that it still applies if the source spectra v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE transactions on neural networks

دوره 11 6  شماره 

صفحات  -

تاریخ انتشار 2000